Computing Scope Dominance with Upward Monotone Quantifiers
نویسندگان
چکیده
This paper describes an algorithm that characterizes logical relations between different interpretations of scopally ambiguous sentences. The proposed method uses general properties of natural language determiners in order to generate a model which is indicative of such entailment relations. The computation of this model involves information about cardinalities of noun denotations and containment relations between them, which often affect entailment relations with quantifiers. After proving the correctness of the proposed method, the paper briefly describes a demo implementation that illustrates its main results.
منابع مشابه
Scope Dominance with Upward Monotone Quantifiers
We give a complete characterization of the class of upward monotone generalized quantifiers Q1 and Q2 over countable domains that satisfy the scheme Q1x Q2y ! Q2y Q1x . This generalizes the characterization of such quantifiers over finite domains, according to which the scheme holds iff either Q1 is 9 or Q2 is 8 (excluding trivial cases). Our result shows that in infinite domains, there are mor...
متن کاملScope Dominance with Monotone Quantifiers over Finite Domains
We characterize pairs of monotone generalized quantifiers Q1 and Q2 over finite domains that give rise to an entailment relation between their two relative scope construals. This relation between quantifiers, which is referred to as scope dominance, is used for identifying entailment relations between the two scopal interpretations of simple sentences of the form NP1-VNP2. Simple numerical or s...
متن کاملOn Scope Dominance With Monotone Quantifiers
We characterize pairs of monotone generalized quantifiers Q1 and Q2 that give rise to an entailment relation between their two relative scope construals. This result is used for identifying entailment relations between the two scopal interpretations of simple sentences of the form NP1-V-NP2 . The general characterization that we give turns out to cover more examples of such entailments besides ...
متن کاملScope Dominance with Generalized Quantifiers
When two quantifiers Q1 and Q2 satisfy the scheme Q1x Q2y φ → Q2y Q1x φ, we say that Q1 is scopally dominant over Q2. This relation is central in analyzing and computing entailment relations between different readings of ambiguous sentences in natural language. This paper reviews the known results on scope dominance and mentions some open problems.
متن کاملNew directions for proof theory in linguistics
We give a complete characterization of the class of upward monotone generalized quantifiers Q1 and Q2 over countable domains that satisfy the scheme Q1x Q2y ! Q2y Q1x . This generalizes the characterization of such quantifiers over finite domains, according to which the scheme holds iff Q1 is 9 or Q2 is 8 (excluding trivial cases). Our result shows that in infinite domains, there are more gener...
متن کامل